home *** CD-ROM | disk | FTP | other *** search
/ Just Call Me Internet / Just Call Me Internet.iso / prog / atari / c / ssl_c1 / raw_nl_c.lzh / MKRAWIDX.C < prev    next >
C/C++ Source or Header  |  1995-04-04  |  11KB  |  354 lines
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #include <string.h>
  4. #include <ext.h>
  5. #include <ctype.h>
  6. #include <portab.h>
  7. #include <defines.h>
  8.  
  9. #define VERSION    "0.10"
  10.  
  11. HEADER         header;
  12. NLHEADER    nlheader;
  13. ENTRY         entry;
  14. byte filenames[10][256];
  15. word types[10],defzones[10],daynumber[10],listcnt=0;
  16. byte networks[10][32];
  17.  
  18. static ulong crc_32_tab[] = { /* CRC polynomial 0xedb88320 */
  19. 0x00000000L, 0x77073096L, 0xee0e612cL, 0x990951baL, 0x076dc419L, 0x706af48fL, 0xe963a535L, 0x9e6495a3L,
  20. 0x0edb8832L, 0x79dcb8a4L, 0xe0d5e91eL, 0x97d2d988L, 0x09b64c2bL, 0x7eb17cbdL, 0xe7b82d07L, 0x90bf1d91L,
  21. 0x1db71064L, 0x6ab020f2L, 0xf3b97148L, 0x84be41deL, 0x1adad47dL, 0x6ddde4ebL, 0xf4d4b551L, 0x83d385c7L,
  22. 0x136c9856L, 0x646ba8c0L, 0xfd62f97aL, 0x8a65c9ecL, 0x14015c4fL, 0x63066cd9L, 0xfa0f3d63L, 0x8d080df5L,
  23. 0x3b6e20c8L, 0x4c69105eL, 0xd56041e4L, 0xa2677172L, 0x3c03e4d1L, 0x4b04d447L, 0xd20d85fdL, 0xa50ab56bL,
  24. 0x35b5a8faL, 0x42b2986cL, 0xdbbbc9d6L, 0xacbcf940L, 0x32d86ce3L, 0x45df5c75L, 0xdcd60dcfL, 0xabd13d59L,
  25. 0x26d930acL, 0x51de003aL, 0xc8d75180L, 0xbfd06116L, 0x21b4f4b5L, 0x56b3c423L, 0xcfba9599L, 0xb8bda50fL,
  26. 0x2802b89eL, 0x5f058808L, 0xc60cd9b2L, 0xb10be924L, 0x2f6f7c87L, 0x58684c11L, 0xc1611dabL, 0xb6662d3dL,
  27. 0x76dc4190L, 0x01db7106L, 0x98d220bcL, 0xefd5102aL, 0x71b18589L, 0x06b6b51fL, 0x9fbfe4a5L, 0xe8b8d433L,
  28. 0x7807c9a2L, 0x0f00f934L, 0x9609a88eL, 0xe10e9818L, 0x7f6a0dbbL, 0x086d3d2dL, 0x91646c97L, 0xe6635c01L,
  29. 0x6b6b51f4L, 0x1c6c6162L, 0x856530d8L, 0xf262004eL, 0x6c0695edL, 0x1b01a57bL, 0x8208f4c1L, 0xf50fc457L,
  30. 0x65b0d9c6L, 0x12b7e950L, 0x8bbeb8eaL, 0xfcb9887cL, 0x62dd1ddfL, 0x15da2d49L, 0x8cd37cf3L, 0xfbd44c65L,
  31. 0x4db26158L, 0x3ab551ceL, 0xa3bc0074L, 0xd4bb30e2L, 0x4adfa541L, 0x3dd895d7L, 0xa4d1c46dL, 0xd3d6f4fbL,
  32. 0x4369e96aL, 0x346ed9fcL, 0xad678846L, 0xda60b8d0L, 0x44042d73L, 0x33031de5L, 0xaa0a4c5fL, 0xdd0d7cc9L,
  33. 0x5005713cL, 0x270241aaL, 0xbe0b1010L, 0xc90c2086L, 0x5768b525L, 0x206f85b3L, 0xb966d409L, 0xce61e49fL,
  34. 0x5edef90eL, 0x29d9c998L, 0xb0d09822L, 0xc7d7a8b4L, 0x59b33d17L, 0x2eb40d81L, 0xb7bd5c3bL, 0xc0ba6cadL,
  35. 0xedb88320L, 0x9abfb3b6L, 0x03b6e20cL, 0x74b1d29aL, 0xead54739L, 0x9dd277afL, 0x04db2615L, 0x73dc1683L,
  36. 0xe3630b12L, 0x94643b84L, 0x0d6d6a3eL, 0x7a6a5aa8L, 0xe40ecf0bL, 0x9309ff9dL, 0x0a00ae27L, 0x7d079eb1L,
  37. 0xf00f9344L, 0x8708a3d2L, 0x1e01f268L, 0x6906c2feL, 0xf762575dL, 0x806567cbL, 0x196c3671L, 0x6e6b06e7L,
  38. 0xfed41b76L, 0x89d32be0L, 0x10da7a5aL, 0x67dd4accL, 0xf9b9df6fL, 0x8ebeeff9L, 0x17b7be43L, 0x60b08ed5L,
  39. 0xd6d6a3e8L, 0xa1d1937eL, 0x38d8c2c4L, 0x4fdff252L, 0xd1bb67f1L, 0xa6bc5767L, 0x3fb506ddL, 0x48b2364bL,
  40. 0xd80d2bdaL, 0xaf0a1b4cL, 0x36034af6L, 0x41047a60L, 0xdf60efc3L, 0xa867df55L, 0x316e8eefL, 0x4669be79L,
  41. 0xcb61b38cL, 0xbc66831aL, 0x256fd2a0L, 0x5268e236L, 0xcc0c7795L, 0xbb0b4703L, 0x220216b9L, 0x5505262fL,
  42. 0xc5ba3bbeL, 0xb2bd0b28L, 0x2bb45a92L, 0x5cb36a04L, 0xc2d7ffa7L, 0xb5d0cf31L, 0x2cd99e8bL, 0x5bdeae1dL,
  43. 0x9b64c2b0L, 0xec63f226L, 0x756aa39cL, 0x026d930aL, 0x9c0906a9L, 0xeb0e363fL, 0x72076785L, 0x05005713L,
  44. 0x95bf4a82L, 0xe2b87a14L, 0x7bb12baeL, 0x0cb61b38L, 0x92d28e9bL, 0xe5d5be0dL, 0x7cdcefb7L, 0x0bdbdf21L,
  45. 0x86d3d2d4L, 0xf1d4e242L, 0x68ddb3f8L, 0x1fda836eL, 0x81be16cdL, 0xf6b9265bL, 0x6fb077e1L, 0x18b74777L,
  46. 0x88085ae6L, 0xff0f6a70L, 0x66063bcaL, 0x11010b5cL, 0x8f659effL, 0xf862ae69L, 0x616bffd3L, 0x166ccf45L,
  47. 0xa00ae278L, 0xd70dd2eeL, 0x4e048354L, 0x3903b3c2L, 0xa7672661L, 0xd06016f7L, 0x4969474dL, 0x3e6e77dbL,
  48. 0xaed16a4aL, 0xd9d65adcL, 0x40df0b66L, 0x37d83bf0L, 0xa9bcae53L, 0xdebb9ec5L, 0x47b2cf7fL, 0x30b5ffe9L,
  49. 0xbdbdf21cL, 0xcabac28aL, 0x53b39330L, 0x24b4a3a6L, 0xbad03605L, 0xcdd70693L, 0x54de5729L, 0x23d967bfL,
  50. 0xb3667a2eL, 0xc4614ab8L, 0x5d681b02L, 0x2a6f2b94L, 0xb40bbe37L, 0xc30c8ea1L, 0x5a05df1bL, 0x2d02ef8dL
  51. };
  52.  
  53. #define UPDC32(octet, crc) (crc_32_tab[((crc) ^ (octet)) & 0xff] ^ ((crc) >> 8))
  54.  
  55. unsigned long crc32str(char *s)
  56. {    register ulong oldcrc32,oldcrc;
  57.     oldcrc32 = 0xFFFFFFFFL; 
  58.     while (*s) 
  59.     {    oldcrc32 = UPDC32((uword) *s, oldcrc32);
  60.         s++;
  61.     }
  62.     oldcrc = oldcrc32 = ~oldcrc32;
  63.     return (oldcrc);
  64. }
  65.  
  66. static void new_entry(uword status,FILE *out,ulong offset,uword zone,uword net,uword node,uword point,byte *name)
  67. {    byte *pointer;
  68.     name=strchr(name+1,',');
  69.     name=strchr(name+1,',');
  70.     name=strchr(name+1,',')+1;
  71.     pointer=strchr(name+1,',');
  72.     if (pointer)
  73.         *pointer='\0';
  74.     
  75.     entry.flags=0;
  76.     pointer=strchr(pointer+1,',');
  77.     pointer=strchr(pointer+1,',');
  78.     pointer=strtok(pointer+1,",");
  79.     while(pointer)
  80.     {    if (!stricmp(pointer,"MO"))        entry.flags|=F_MO;
  81.         if (!stricmp(pointer,"CM"))        entry.flags|=F_CM;
  82.         pointer=strtok(NULL,",");
  83.     }
  84.  
  85.     pointer=strrchr(name,'_');
  86.     if (pointer)
  87.         *pointer=' ';
  88.     
  89.     entry.zone=zone;
  90.     entry.net=net;
  91.     entry.node=node;
  92.     entry.point=point;
  93.     entry.offset=offset;
  94.     entry.status=(ubyte)status;
  95.     entry.sysopcrc32=crc32str(strupr(name));
  96.     fwrite(&entry,sizeof(ENTRY),1,out);
  97. }
  98.  
  99. /*
  100. ** defzone is not yet used. This parameter is neccessary when
  101. **         including a 3d pointlist.
  102. ** pointlist must be TRUE when parsing a pointlist and otherwise FALSE
  103. */
  104.  
  105. static ulong parse_list(FILE *fp,ubyte *src,uword nlnumber,uword defzone,uword pointlist)
  106. {    uword    zone=0,net=0,node=0,point=0,i;
  107.     ulong    counter=0,offset=0;
  108.     FILE    *in;
  109.     ubyte    line[256],*pointer,*pointer2;
  110.  
  111.     entry.nodelist=nlnumber;
  112.  
  113.     printf("List: %s\n\r",src);
  114.     in    = fopen(src,"rb");
  115.     setvbuf(in ,NULL,_IOFBF,32768U);
  116.     printf("Converting... %lu\r",counter);
  117.  
  118.     if (pointlist)
  119.         zone=defzone;
  120.  
  121.     fgets(line,256,in);
  122.     while (!feof(in))
  123.     {    if (*line!=';')
  124.         {    
  125.             if (!strnicmp(line,"zone",4))
  126.             {    zone=atoi((pointer=strchr(line,','))+1);
  127.                 node=point=0;
  128.                 net=zone;
  129.                 counter++;
  130.                 new_entry(ZONE,fp,offset,zone,net,node,point,pointer);
  131.             }
  132.             else if (!strnicmp(line,"region",6))
  133.             {    net=atoi((pointer=strchr(line,','))+1);
  134.                 node=point=0;
  135.                 if (!pointlist)
  136.                 {    counter++;
  137.                     new_entry(REGION,fp,offset,zone,net,node,point,pointer);
  138.                 }
  139.             }
  140.             else if (!strnicmp(line,"host",4))
  141.             {    pointer=strchr(line,',');
  142.                 if (pointlist)
  143.                 {    pointer2=strchr(pointer+1,',');
  144.                     net=atoi(pointer2+1);
  145.                     pointer2=strchr(pointer2+1,'/');
  146.                     if (pointer2==NULL)
  147.                     {    net=atoi(line+5);    /* ERROR: use Fakenet */
  148.                         node=0;
  149.                     }
  150.                     else
  151.                         node=atoi(pointer2+1);
  152.                 }
  153.                 else
  154.                 {    net=atoi(pointer+1);
  155.                 }
  156.                 point=0;
  157.                 counter++;
  158.                 new_entry(HOST,fp,offset,zone,net,node,point,pointer);
  159.             }
  160.             else if ( *line==','                                        ||
  161.                               strnicmp(line,"hub",3)==0            ||
  162.                               strnicmp(line,"down",4)==0        ||
  163.                               strnicmp(line,"hold",4)==0        ||
  164.                               strnicmp(line,"pvt",3)==0 )
  165.             {    pointer=strchr(line,',');
  166.                 if (pointlist)
  167.                 {    point=atoi(pointer+1);
  168.                     if (!node)
  169.                     {    node=point;
  170.                         point=0;
  171.                     }
  172.                 }
  173.                 else
  174.                 {    node=atoi(pointer+1);
  175.                 }
  176.                 i=NODE;
  177.                 switch(line[2])
  178.                 { case 'b': case 'B' : i=HUB;     break;
  179.                     case 't': case 'T' : i=PVT;     break;
  180.                     case 'w': case 'W' : i=DOWN;     break;
  181.                     case 'l': case 'L' : i=HOLD;     break;
  182.                 }
  183.                 counter++;
  184.                 new_entry(i,fp,offset,zone,net,node,point,pointer);
  185.             }
  186.         }
  187.         if (!(counter & 0xff))
  188.             printf("Converting... %lu\r",counter);
  189.  
  190.         offset=ftell(in);
  191.         fgets(line,256,in);
  192.     }
  193.     printf("Converted.... %lu names\n\n",counter);
  194.     fclose(in);
  195.     return(counter);
  196. }
  197.  
  198. word compare(ENTRY *e1, ENTRY *e2)
  199. {
  200.     if (e1->nodelist < e2->nodelist)
  201.         return(-1);
  202.     else if (e1->nodelist > e2->nodelist)
  203.         return(1);
  204.     else if (e1->zone < e2->zone)
  205.         return(-1);
  206.     else if (e1->zone > e2->zone)
  207.         return(1);
  208.     else if (e1->net < e2->net)
  209.         return(-1);
  210.     else if (e1->net > e2->net)
  211.         return(1);
  212.     else if (e1->node < e2->node)
  213.         return(-1);
  214.     else if (e1->node > e2->node)
  215.         return(1);
  216.     else if (e1->point < e2->point)
  217.         return(-1);
  218.     else if (e1->point > e2->point)
  219.         return(1);
  220.     else
  221.         return(0);
  222. }
  223.  
  224. static word search_filename(byte *fname)    /* Quick'n'Dirty function */
  225. {    struct ffblk DTA;
  226.     byte *p1,*p2;
  227.     if (findfirst(fname,&DTA,0))
  228.         return(0);
  229.     p2=strrchr(fname,'.');
  230.     do
  231.     {
  232.         p1=strchr(DTA.ff_name,'\0')-3;
  233.         if (isdigit(*p1) && isdigit(p1[1]) && isdigit(p1[2]))
  234.         {    strcpy(p2+1,p1);
  235.             return(atoi(p1));
  236.         }
  237.     }
  238.     while (!findnext(&DTA));
  239.     return(0);
  240. }
  241.  
  242. int main(void)
  243. {    word i;
  244.     byte temp[256],temp2[256],*p,*cmd;
  245.     long entries,cnt;
  246.     ENTRY *tempentry;
  247.     FILE    *fp,*fout;
  248.  
  249.     fp=fopen("MKRAWIDX.CFG", "r");
  250.     while(fgets(temp, 255, fp))       /* read a line */
  251.     {    p=strtok(temp," \t\n\r");
  252.         cmd=strtok(NULL," \t\n\r");
  253.         if (p==NULL || cmd==NULL)    continue;
  254.         if (*p==';') continue;
  255.         if (!stricmp(p,"Nodelist"))
  256.         {    types[listcnt]=
  257.             defzones[listcnt]=0;
  258.             strcpy(networks[listcnt],cmd);
  259.             cmd=strtok(NULL," \t\n\r");
  260.             strcpy(temp2,cmd);
  261.             if ((daynumber[listcnt]=search_filename(temp2))==0)
  262.             {    fprintf(stderr,"Nodelist open error: %s\n",cmd);
  263.                 return(1);
  264.             }
  265.             strcpy(filenames[listcnt],temp2);
  266.             listcnt++;
  267.         }
  268.         else if (!stricmp(p,"Pointlist"))
  269.         {    types[listcnt]=1;
  270.             strcpy(networks[listcnt],cmd);
  271.             cmd=strtok(NULL," \t\n\r");
  272.             strcpy(temp2,cmd);
  273.             if ((daynumber[listcnt]=search_filename(temp2))==0)
  274.             {    fprintf(stderr,"Pointlist open error: %s\n",cmd);
  275.                 return(1);
  276.             }
  277.             strcpy(filenames[listcnt],temp2);
  278.             cmd=strtok(NULL," \t\n\r");
  279.             if (cmd)
  280.                 defzones[listcnt]=atoi(cmd);
  281.             else
  282.                 defzones[listcnt]=0;
  283.             listcnt++;
  284.         }
  285.     }
  286.     fclose(fp);
  287.  
  288.     printf("MKRAWIDX V"VERSION"   Nodelist-Utility (Demo)     (c) Stephan Slabihoud 1995\n\n\n");
  289.  
  290. /*
  291. ** Open output file
  292. */
  293.  
  294.     fp=fopen("NODELIST.$$$","wb");
  295.  
  296. /*
  297. ** Create header. Note: header.version is 0x0001 !
  298. */
  299.  
  300.     header.version=0x0001;
  301.     time(&(time_t)header.datetime);
  302.     header.nodelists=listcnt;                        /* number of nodelists */
  303.     header.flag=1;                                            /* output is sorted          */
  304.     fwrite(&header,sizeof(HEADER),1,fp);
  305.  
  306. /*
  307. ** Now write all Nodelist-Header...
  308. */
  309.  
  310.     for (i=0; i<header.nodelists; i++)
  311.     {    nlheader.type=types[i];                                /* nodelists or pointlist             */
  312.         nlheader.day=daynumber[i];                        /* daynumber                                     */
  313.         strcpy(nlheader.network,networks[i]);    /* name of network                         */
  314.         strcpy(nlheader.file,filenames[i]);        /* filename                                         */
  315.         fwrite(&nlheader,sizeof(NLHEADER),1,fp);
  316.     }
  317.  
  318. /*
  319. ** ...and all nodelist entries
  320. */
  321.  
  322.     entries=0;
  323.     for (i=0; i<header.nodelists; i++)
  324.         entries+=parse_list(fp,filenames[i],i,defzones[i],types[i]==0 ? FALSE : TRUE);
  325.  
  326.     fclose(fp);
  327.  
  328.     printf("\nPass 2: Sorting %lu entries\n\n\r",entries);
  329.     fp=fopen("NODELIST.$$$","rb");
  330.     fout=fopen("NODELIST.RDX","wb");
  331.     fread(&header,sizeof(HEADER),1,fp);
  332.     fwrite(&header,sizeof(HEADER),1,fout);
  333.     for (i=1; i<=header.nodelists; i++)
  334.     {    fread(&nlheader,sizeof(NLHEADER),1,fp);
  335.         fwrite(&nlheader,sizeof(NLHEADER),1,fout);
  336.     }
  337.     tempentry=(ENTRY *)calloc(entries,sizeof(ENTRY));
  338.     if (!tempentry)
  339.     {    fclose(fp);
  340.         fclose(fout);
  341.         return(1);
  342.     }
  343.     for (cnt=0;cnt<entries;cnt++)
  344.         fread(&tempentry[cnt],sizeof(ENTRY),1,fp);
  345.     qsort(&tempentry[0],entries,sizeof(ENTRY),compare);
  346.     for (cnt=0;cnt<entries;cnt++)
  347.         fwrite(&tempentry[cnt],sizeof(ENTRY),1,fout);
  348.     fclose(fout);
  349.     fclose(fp);
  350.     remove("NODELIST.$$$");
  351.     free(tempentry);
  352.     return(0);
  353. }
  354.